Signed coloring of 2-dimensional grids
نویسندگان
چکیده
منابع مشابه
Coloring Signed Graphs
This survey paper provides an introduction to signed graphs, focusing on coloring. We shall introduce the concept of signed graphs, a proper coloring, and basic properties, such as a balanced graph and switchings. We will examine the chromatic number for six special signed graphs, upper bound the chromatic number, and discuss practical applications of signed graphs.
متن کاملColoring signed graphs using DFS
We show that depth first search can be used to give a proper coloring of connected signed graphs G using at most ∆(G) colors, provided G is different from a balanced complete graph, a balanced cycle of odd length, and an unbalanced cycle of even length, thus giving a new, short proof to the generalization of Brooks’ theorem to signed graphs, first proved by Máčajová, Raspaud, and Škoviera.
متن کاملOn Refinement of 2-Dimensional Grids
The subject of this paper are grid refinements arising in finite element methods and their embedding into grids. We concentrate on embeddings with dilation 1 and construct for a class of grid refinements their embeddings with optimal load. For general cases we show that the problem to determine the minimal load is NP-complete.
متن کاملOn Re nement of 2-Dimensional Grids
The subject of this paper are grid reenements arising in nite element methods and their embedding into grids. We concentrate on embeddings with dilation 1 and construct for a class of grid reenements their embeddings with optimal load. For general cases we show that the problem to determine the minimal load is NP-complete.
متن کاملdynamic coloring of graph
در این پایان نامه رنگ آمیزی دینامیکی یک گراف را بیان و مطالعه می کنیم. یک –kرنگ آمیزی سره ی رأسی گراف g را رنگ آمیزی دینامیکی می نامند اگر در همسایه های هر رأس v?v(g) با درجه ی حداقل 2، حداقل 2 رنگ متفاوت ظاهر شوند. کوچکترین عدد صحیح k، به طوری که g دارای –kرنگ آمیزی دینامیکی باشد را عدد رنگی دینامیکی g می نامند و آنرا با نماد ?_2 (g) نمایش می دهند. مونت گمری حدس زده است که تمام گراف های منتظم ...
15 صفحه اولذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information Processing Letters
سال: 2020
ISSN: 0020-0190
DOI: 10.1016/j.ipl.2020.105918